Sort-Mid tasks scheduling algorithm in grid computing
نویسندگان
چکیده
منابع مشابه
Sort-Mid tasks scheduling algorithm in grid computing
Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a ne...
متن کاملScheduling Tasks in Grid Computing Environments
Scheduling tasks on different resources spread over a grid computing system is an NP complete problem. Assorted researchers are developing adaptation scheduling algorithms for getting optimality. Hence they have proved a good result for tasks scheduling about resources selection. In this review, we study the Group-based Parallel Multi-scheduler (GPMS). It is focused on effectively utilizing the...
متن کاملOptimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملHierarchical Scheduling Algorithm for Grid Computing Environment
Grid computing is increasingly being viewed as the next phase of distributed computing. Grid aims to maximize the utilization of an organization's computing resources by making them shareable across applications. In grid computing, job scheduling is an important task. Load balancing and proper resource allocation are critical issues that must be considered in managing a grid computing environme...
متن کاملScheduling of Dynamic Tasks in Wireless Grid Computing Using Optimized Final Sternness Priority Rule (ofspr) Algorithm
Over the past several years, Grid computing is emerged as one of the most important and scalable alternatives to high performance supercomputing. Dynamic nature of grid computing is difficult to come up with near optimal solutions to effectively schedule the tasks in grids. This paper proposes a novel scheduling strategies and dynamically schedules the tasks by using Optimized final Sternness P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Research
سال: 2015
ISSN: 2090-1232
DOI: 10.1016/j.jare.2014.11.010